Solovay reducibility and continuity
نویسندگان
چکیده
منابع مشابه
L1-Computability, Layerwise Computability and Solovay Reducibility
We propose a hierarchy of classes of functions that corresponds to the hierarchy of randomness notions. Each class of functions converges at the corresponding random points. We give various characterizations of the classes, that is, characterizations via integral tests, L-computability and layerwise computability. Furthermore, the relation among these classes is formulated using a version of So...
متن کاملSolovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The Solovay reducibility classifies elegantly the relative randomness of c.e. reals. Especially, the c.e. random reals are complete unter the Solovay reducibility for c.e. reals. In this paper we investigate an extension...
متن کاملOn the Extensions of Solovay-Reducibility
A c.e. real x is Solovay reducible (S-reducible) to another c.e. real y if y is at least as difficult to be approximated as x. In this case, y is at least as random as x. Thus, the S-reducibility classifies relative randomness of c.e. reals such that the c.e. random reals are complete in the class of c.e. reals under the S-reducibility. In this paper we investigate extensions of the S-reducibil...
متن کاملKolmogorov Complexity and Solovay Functions
Solovay [19] proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f(x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) ≤ f(x)+O(1) for all x and f(x) ≤ K(x) + O(1) for infinitely many x, which we call Solovay functions. We show that Solovay functions present interesting conne...
متن کاملSolovay functions and K-triviality
As part of his groundbreaking work on algorithmic randomness, Solovay demonstrated in the 1970s the remarkable fact that there are computable upper bounds of prefix-free Kolmogorov complexity K that are tight on infinitely many values (up to an additive constant). Such computable upper bounds are called Solovay functions. Recent work of Bienvenu and Downey [STACS 2009, LIPIcs 3, pp 147-158] ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Analysis
سال: 2020
ISSN: 1759-9008
DOI: 10.4115/jla.2020.12.2